Augmentations of consistent partial orders for the one-machine total tardiness problem
نویسندگان
چکیده
منابع مشابه
Augmentations of Consistent Partial orders for the one-machine Total Tardiness Problem
A partial order on a job set is called consistent, if it has a linear extension which is an optimal solution to the total tardiness problem of the job set. The concept of proper augmentations of consistent partial orders is based on Emmons’ well-known dominance theorem. In this paper, we address the question of whether the proper augmentation of a consistent partial order always results in a pa...
متن کاملThe two - machine flow shop problem with delays and the one - machine total tardiness problem
A partial order on a job set is called consistent, if it has a linear extension which is an optimal solution to the total tardiness problem of the job set. The concept of proper augmentations of consistent partial orders is based on Emmons' well-known dominance theorem. In this paper, we address the question whether the proper augmentation of a consistent partial order always results in a parti...
متن کاملOn the single machine total tardiness problem
In this paper we study the single machine total tardiness problem. We first identify some optimality properties based on which a special case with a given number of distinct due dates is proved polynomially solvable. The results are then extended to the case with release dates. 2004 Published by Elsevier B.V.
متن کاملNew Instances for the Single Machine Total Weighted Tardiness Problem
Previous research in the single machine total weighted tardiness problem (SMTWTP) has led to the proposition of effective local search strategies. At least existing benchmark instances from the literature do not pose a challenge for state-of-the-art algorithms. This paper describes the proposition of two classes of novel instances for the single machine total weighted tardiness problem. In resp...
متن کاملA hybrid algorithm for the single-machine total tardiness problem
We propose a hybrid algorithm based on the Ant Colony Optimization (ACO) meta-heuristic, in conjunction with four well-known elimination rules, to tackle the NP -hard single-machine scheduling problem to minimize the total job tardiness. The hybrid algorithm has the same running time as that of ACO. We conducted extensive computational experiments to test the performance of the hybrid algorithm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1996
ISSN: 0166-218X
DOI: 10.1016/0166-218x(95)00051-r